Constructing paths to avoid multiple obstacles

Map Move To Region Avoid Obstacles

Age effects on strategies used to avoid obstacles

Chen et al.’ found that the rates of success which 24 healthy younger and 24 healthy older adults achieved in not stepping on fixed and suddenly appearing virtual obstacles was adversely affected by reducing their available response time. This paper reports the gait strategies used by those 48 subjects in avoiding the obstacles and the factors associated with falls by four of the subjects. Diff...

Rectilinear Paths among Rectilinear Obstacles

Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...

Computing simple paths among obstacles

Given a set X of points in the plane, two distinguished points s; t 2 X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t that uses only points in X as vertices and avoids the obstacles in. We present two results: (1) We show that nding such simple paths among arbitrary obstacles is NP-complete. (2) We give a polynomial-time algorithm t...

Label updating to avoid point-shaped obstacles in fixed model

In this paper, we present efficient algorithms for updating the labeling of a set of n points after the presence of a random obstacle that appears on the map repeatedly. We update the labeling so that the given obstacle does not appear in any of the labels, the new labeling is valid, and the labels are as large as possible (called the optimal labeling). Each point is assumed to have an axis-par...